Multi-processor Game-tree Search
نویسندگان
چکیده
The design, implementation, and performance of two chess programs running on a multi-processor system are presented. Methods for distributing and enhancing the alpha-beta algorithm in a parallel environment are discussed. With the Principal Variation Splitting method, a four processor chess program yields a 3.35 fold speed-up over the sequential version. [Recreated from files dated 4 May 1984 in /tony/Papers/papers/acc4]
منابع مشابه
Performance Analysis of Two Parallel Game-Tree Search Applications
Game-tree search plays an important role in the field of artificial intelligence. In this paper we analyze scalability performance of two parallel game-tree search applications in chess on two shared-memory multiprocessor systems. One is a recently-proposed Parallel Randomized Best-First Minimax search algorithm (PRBFM) in a chess-playing program, and the other is Crafty, a state-of-the-art alp...
متن کاملMonte-Carlo Tree Search for Poly-Y
Monte-Carlo tree search (MCTS) is a heuristic search algorithm that has recently been very successful in the games of Go and Hex. In this paper, we describe an MCTS player for the game of Poly-Y, which is a connection game similar to Hex. Our player won the CodeCup 2014 AI programming competition. Our player uses MCTS with the all-moves-as-first heuristic, and detects basic heuristic patterns t...
متن کاملParallel and Concurrent Search for Fast And/or Tree Search Onmulticore Processors
This paper proposes a fast AND/OR tree search algorithm using a multiple paths parallel and concurrent search scheme for embedded multicore processors. Currently, not only PCs or supercomputers but also information appliances such as game consoles, mobile devices and car navigation systems are equipped with multicore processors for better cost performance and lower power consumption. However, t...
متن کاملA General Multi-Agent Modal Logic K Framework for Game Tree Search
We present an application of Multi-Agent Modal Logic K (MMLK) to model dynamic strategy game properties. We also provide several search algorithms to decide the model checking problem in MMLK. In this framework, we distinguish between the solution concept of interest which is represented by a class of formulas in MMLK and the search algorithm proper. The solution concept defines the shape of th...
متن کاملGame-Tree Simplification by Pattern Matching and Its Acceleration Approach using an FPGA
In this paper, we propose a Connect6 solver which adopts a hybrid approach based on a tree-search algorithm and image processing techniques. The solver must deal with the complicated computation and provide high performance in order to make real-time decisions. The proposed approach enables the solver to be implemented on a single Spartan-6 XC6SLX45 FPGA produced by XILINX without using any ext...
متن کامل